package com.leetcode.algorithm.y22.todo;

/**
 * 621. 任务调度器
 * 
 * https://leetcode.cn/problems/task-scheduler/
 * 
 * @author jie.deng
 *
 */
class Question0621Solution01 {

	public int leastInterval(char[] tasks, int n) {
		int len = tasks.length;
		if (n == 0) {
			return len;
		}
		int[] cntArr = new int[26];
		for (int i = 0; i < len; i++) {
			cntArr[tasks[i] - 'A']++;
		}
		// TODO
		return n;
	}

}